On properties of square-free elements in commutative cancellative monoids
نویسندگان
چکیده
منابع مشابه
Primary ideals of finitely generated commutative cancellative monoids
We give a characterization of primary ideals of finitely generated commutative monoids and in the case of finitely generated cancellative monoids we give an algorithmic method for deciding if an ideal is primary or not. Finally we give some properties of primary elements of a cancellative monoid and an algorithmic method for determining the primary elements of a finitely generated cancellative ...
متن کاملOn the set of catenary degrees of finitely generated cancellative commutative monoids
The catenary degree of an element s of a cancellative commutative monoid S is a nonnegative integer measuring the distance between the irreducible factorizations of s. The catenary degree of the monoid S, defined as the supremum over all catenary degrees occurring in S, has been heavily studied as an invariant of nonunique factorization. In this paper, we investigate the set C(S) of catenary de...
متن کاملThe Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids
A. Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S )) and the tame degree of S (denoted t(S )) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we ...
متن کاملOn the Cubical Homology Groups of Free Partially Commutative Monoids
We study a Leech homology of a locally bounded free partially commutative monoid M(E, I). Given a contravariant natural system of abelian groups F on M(E, I) we build a precubical set T (E, I) with a homological system of abelian groups F and prove that the Leech homology groups Hn(M(E, I), F ) are isomorphic to the cubical homology groups Hn(T (E, I), F ), n > 0. As a consequence we have confi...
متن کاملPresentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations
Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid.We use an algorithm of Contejean andDevie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. andComput. 113 (1994) 143–172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2019
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-019-10022-3